Nonplanar graphs in boundaries of CAT(0) groups
نویسندگان
چکیده
منابع مشابه
commuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولPlanar Graphs on Nonplanar Surfaces
It is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere have a special structure. It turns out that these embeddings can be described in terms of noncontractible curves in the surface, meeting the graph in at most two points (which may taken to be vertices of the graph). The close connection between the homology group of the surface and the planar graph embedd...
متن کاملOn Maximal Planarization of Nonplanar Graphs
K. THULASIRAMAN, R. JAYAKUMAR, at X can be rearranged such that all the descendant pertinent AND M. N. S. SWAMY leaves of X appear consecutively at either the left or the right end of the frontier, with at least one nonpertinent leaf appearing at Absrruct--In this paper, we first point out that the planarization althe other end of the frontier. gorithm due to Ozawa and Takabashi [4] does not in...
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملAutomatic Structures and Boundaries for Graphs of Groups
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product bijects to the product of the sets of biautomatic structures on the vertex groups. The set of automatic structures is much richer. Indeed, it is dense in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2020
ISSN: 1661-7207
DOI: 10.4171/ggd/577